Understanding PPA-completeness

نویسندگان

چکیده

We show that computation of the SPERNER problem is PPA-complete on Möbius band under proper boundary conditions, settling a long term open problem. Further, same computational complexity results extend to other discrete fixed points band, such as Brouwer point problem, DPZP and simple version Tucker well projective plane Klein bottle. expect it opens up new route for further studies related combinatorial structures.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Understanding PPA-Completeness

The search complexity classes PPA and PPAD were proposed by Papadimitriou twenty years ago for characterizing the computational difficulties of many interesting natural search problems. While many members in the complete class of PPAD, PPAD-complete, are established in the past twenty years, the understanding of the PPA-complete class falls far behind. We consider the problem of finding a fully...

متن کامل

PPA Printer Firmware Design

A significant factor in Hewlett-Packard’s new Printing Performance Architecture (see Article 1) is the reduction of the processing power embedded in the printer. Using the host PC for all image formatting leaves only motor, print cartridge, I/O, user interface, command, and status functions to be controlled by the firmware. This results in significant cost savings by reducing processor needs an...

متن کامل

Grammatical Impairments in PPA.

BACKGROUND Grammatical impairments are commonly observed in the agrammatic subtype of primary progressive aphasia (PPA-G), whereas grammatical processing is relatively preserved in logopenic (PPA-L) and semantic (PPA-S) subtypes. AIMS We review research on grammatical deficits in PPA and associated neural mechanisms, with discussion focused on production and comprehension of four aspects of m...

متن کامل

Octahedral Tucker is PPA-Complete

The Octahedral Tucker problem considers an n-dimensional hypergrid of side length two, centered at the origin, triangulated by connecting the origin to all outside vertices (applied recursively on each of the lower dimensional hypergrids passing through their origins at the corresponding reduced dimensions). Each vertex is assigned a color in ±i : i = 1, 2, ..., n computed using a polynomial si...

متن کامل

Using PPA for weight management?

I've been concerned about my weight all through college. I have what you would call a subclinical eating disorder that never goes so far as anorexia or bulimia. My question is: I have been using diet suppressants (phenylpropanolamine HCL 75mg) bought over the counter for months. Sometimes I don't take them for a week, but usually I take one dose a few times a week. I know it's not recommended t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2021

ISSN: ['1090-2724', '0022-0000']

DOI: https://doi.org/10.1016/j.jcss.2020.07.006